Continuous-time orbit problems are decidable in polynomial-time
نویسندگان
چکیده
منابع مشابه
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs. In polynomial constant propagation, assignment state...
متن کاملPseudoconvex Multiobjective Continuous-time Problems and Vector Variational Inequalities
In this paper, the concept of pseudoconvexity and quasiconvexity for continuous~-time functions are studied and an equivalence condition for pseudoconvexity is obtained. Moreover, under pseudoconvexity assumptions, some relationships between Minty and Stampacchia vector variational inequalities and continuous-time programming problems are presented. Finally, some characterizations of the soluti...
متن کاملPolynomial-time Word Problems
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these results follow from observing that automorphisms of the free group strongly resemble straight line programs, which are widely studied in the theory of compressed d...
متن کاملFp 1 Is Undecidable for Nitely Presented Monoids with Word Problems Decidable in Polynomial Time
In the rst part of this paper properties P of nitely presented monoids are considered that satisfy the following two conditions: (1) each monoid that can be presented through a nite convergent string-rewriting system has property P , and (2) each nitely presented monoid having property P is of homology type FP3. Following an idea presented in (Otto and Sattler-Klein 1997) it is shown that these...
متن کاملRegularity is Decidable for Normed PA Processes in Polynomial Time
A process ∆ is regular if it is bisimilar to a process ∆′ with finitely many states. We prove that regularity of normed PA processes is decidable and we present a practically usable polynomial-time algorithm. Moreover, if the tested normed PA process ∆ is regular then the process ∆′ can be effectively constructed. It implies decidability of bisimulation equivalence for any pair of processes suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2015
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2014.08.004